Fuzzy Subspace Clustering
نویسنده
چکیده
In clustering we often face the situation that only a subset of the available attributes is relevant for forming clusters, even though this may not be known beforehand. In such cases it is desirable to have a clustering algorithm that automatically weights attributes or even selects a proper subset. In this paper I study such an approach for fuzzy clustering, which is based on the idea to transfer an alternative to the fuzzifier [15] to attribute weighting fuzzy clustering [14]. In addition, by reformulating Gustafson–Kessel fuzzy clustering, a scheme for weighting and selecting principal axes can be obtained. While in [5] I already presented such an approach for a global selection of attributes and principal axes, this paper extends it to a cluster-specific selection, thus arriving at a fuzzy subspace clustering algorithm.
منابع مشابه
A Fuzzy Subspace Algorithm for Clustering High Dimensional Data
In fuzzy clustering algorithms each object has a fuzzy membership associated with each cluster indicating the degree of association of the object to the cluster. Here we present a fuzzy subspace clustering algorithm, FSC, in which each dimension has a weight associated with each cluster indicating the degree of importance of the dimension to the cluster. Using fuzzy techniques for subspace clus...
متن کاملData-driven modeling and predictive control for boiler-turbine unit using fuzzy clustering and subspace methods.
This paper develops a novel data-driven fuzzy modeling strategy and predictive controller for boiler-turbine unit using fuzzy clustering and subspace identification (SID) methods. To deal with the nonlinear behavior of boiler-turbine unit, fuzzy clustering is used to provide an appropriate division of the operation region and develop the structure of the fuzzy model. Then by combining the input...
متن کاملApplication of Fuzzy Classification in Bankruptcy Prediction
Classification refers to a set of methods that predict the class of an object from attributes or features describing the object. In this paper we present a fuzzy classification algorithm to predict bankruptcy. Our classification algorithm is modified from a subspace clustering algorithm called fuzzy subspace clustering (FSC). As our algorithm associates each feature of a class with a fuzzy memb...
متن کاملA convergence theorem for the fuzzy subspace clustering (FSC) algorithm
We establish the convergence of the fuzzy subspace clustering (FSC) algorithm by applying Zangwill’s convergence theorem. We show that the iteration sequence produced by the FSC algorithm terminates at a point in the solution set S or there is a subsequence converging to a point in S. In addition, we present experimental results that illustrate the convergence properties of the FSC algorithm in...
متن کاملDiscriminative Transformation Learning for Fuzzy Sparse Subspace Clustering
This paper develops a novel iterative framework for subspace clustering (SC) in a learned discriminative feature domain. This framework consists of two modules of fuzzy sparse SC and discriminative transformation learning. In the first module, fuzzy latent labels containing discriminative information and latent representations capturing the subspace structure will be simultaneously evaluated in...
متن کامل